'''
Python implementation of the Gap-Bide algorithm.
Based on
Chun Li,Jianyong Wang. 
Efficiently Mining Closed Subsequences with Gap Constraints.
Siam SDM 2008.

Copyright (c) 2010 by Chun Li

Permission is hereby granted, free of charge, to any person 
obtaining a copy of this software and associated documentation 
files (the "Software"), to deal in the Software without restriction, 
including without limitation the rights to use, copy, modify, merge, 
publish, distribute, sublicense, and/or sell copies of the Software, 
and to permit persons to whom the Software is furnished to do so, 
subject to the following conditions:

The above copyright notice and this permission notice shall be 
included in all copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 
EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES 
OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS 
BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN 
ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN 
CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE 
SOFTWARE.
'''
class Gapbide:
    def __init__(self, sdb, sup, m, n):
        '''
        sdb: alist of sequences,
        sup: the minimum threshold of support,
        m,n: the gap [m,n]
        '''
        self.sdb = sdb
        self.sup = sup
        self.m = m
        self.n = n
        self.count_closed = 0
        self.count_non_closed = 0
        self.count_pruned = 0
    
    def run(self):
        l1_patterns= self.gen_l1_patterns()
        for pattern,sup,pdb in l1_patterns:
            self.span( pattern, sup, pdb )
    
    def output(self, pattern, sup , pdb):
        '''
        overide this function to output patterns to files.
        '''
        print pattern, sup, pad
        
    def gen_l1_patterns(self):
        '''
        generate length-1 patterns
        '''
        pdb_dict = dict()
        for sid in range(len(self.sdb)):
            seq = self.sdb[sid]
            for pos in range(len(seq)):
                if pdb_dict.has_key( seq[pos] ):
                    pdb_dict[seq[pos]].append( (sid, pos, pos) )
                else:
                    pdb_dict[seq[pos]] = [ (sid, pos, pos) ]
        patterns = []
        for item, pdb in pdb_dict.items():
            sup = len(set([i[0] for i in pdb]))
            if sup >= self.sup:
                patterns.append( ([item], sup, pdb) )
        return patterns
    
    def span(self, pattern, sup, pdb):
        (backward,prune) = self.backward_check( pattern, sup, pdb)
        if prune:
            self.count_pruned += 1
            return
        forward = self.forward_check(pattern, sup, pdb)
        if not( backward or forward):
            self.count_closed += 1
            self.output( pattern, sup, pdb )
        else:
            self.count_non_closed += 1
        pdb_dict = dict()
        for (sid, begin, end) in pdb:
            seq = self.sdb[sid]
            new_begin = end + 1 + self.m
            new_end = end + 2 + self.n
            if new_begin >= len(seq): continue
            if new_end > len(seq): new_end = len(seq)
            for pos in range(new_begin, new_end):
                if pdb_dict.has_key( seq[pos] ):
                    pdb_dict[seq[pos]].append( (sid, begin, pos) )
                else:
                    pdb_dict[seq[pos]] = [ (sid, begin, pos) ]
        for item, new_pdb in pdb_dict.items():
            sup = len(set([i[0] for i in new_pdb]))
            if sup >= self.sup:
                #add new pattern
                new_pattern = pattern[:]
                new_pattern.append(item)
                self.span(new_pattern, sup, new_pdb)
                
    def forward_check(self, pattern, sup, pdb):
        sids = {}
        forward = False
        for (sid, begin, end) in pdb:
            seq = self.sdb[sid]
            new_begin = end + 1 + self.m
            new_end = end + 2 + self.n
            if new_begin >= len(seq): continue
            if new_end > len(seq): new_end = len(seq)
            for pos in range(new_begin, new_end):
                if sids.has_key( seq[pos] ):
                    sids[ seq[pos] ].append( sid )
                else:
                    sids[ seq[pos] ] = [sid]
        for item,sidlist in sids.items():
            seq_sup = len(set(sidlist))
            if seq_sup == sup:
                forward = True
                break
        return forward

    def backward_check(self, pattern, sup, pdb):
        sids = {}
        backward = False
        prune = False
        for (sid, begin, end) in pdb:
            seq = self.sdb[sid]
            new_begin = begin - self.n - 1
            new_end = begin - self.m - 1
            if new_end < 0: continue
            if new_begin < 0: new_begin = 0
            for pos in range(new_begin, new_end):
                if sids.has_key( seq[pos] ):
                    sids[ seq[pos] ].append( sid )
                else:
                    sids[ seq[pos] ] = [sid]
        for item,sidlist in sids.items():
            seq_sup = len(set(sidlist))
            uni_sup = len(sidlist)
            if uni_sup == len(pdb):
                prune = True
            if seq_sup == sup:
                backward = True
            if backward and prune:
                break
        return (backward, prune)

    